package written.test;

import java.util.HashSet;
import java.util.Scanner;

/**
 * @Author: Dang Qi
 * @Date: 2021/4/4  10:04
 * @Description:
 */
public class Mei {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String str = sc.next();
        dfs(str, 0);
        System.out.println(ans);
    }
    static int[] set = new int[26];
    static int ans= 0;
    public static void dyp(String str, int index){

    }
    public static void dfs(String str, int index){
        if(index >= str.length()){
            ans = (ans + 1) % 20210101;
            return;
        }
        Character ch = str.charAt(index);
        if(set[ch-'a']==1){
            dfs(str, index+1);
        }else{
            dfs(str, index+1);
            set[ch-'a'] = 1;
            dfs(str, index+1);
            set[ch-'a'] = 0;
        }
    }
}

